An Efficient Implementation of the PC-Tree Algorithm of Shih & Hsu’s Planarity Test
نویسنده
چکیده
In Shih & Hsu [9] a simpler planarity test was introduced utilizing a data structure called PC-trees (generalized from PQ-trees). In this paper we give an efficient implementation of that linear time algorithm and illustrate in detail how to obtain a Kuratowski subgraph when the given graph is not planar, and how to obtain the embedding alongside the testing algorithm. We have implemented the algorithm using LEDA and an object code is available at http://qa.iis.sinica.edu.tw/graphtheory/. The main part of the implementation is devoted to the treatment of the C-nodes that represent those 2-connected components.
منابع مشابه
An Efficient Implementation of the PC - Tree Algorithm of
In Shih & Hsu [9] a simpler planarity test was introduced utilizing a data structure called PC-trees (generalized from PQ-trees). In this paper we give an efficient implementation of that linear time algorithm and illustrate in detail how to obtain a Kuratowski’s subgraph when the given graph is not planar and how to obtain the embedding alongside the testing algorithm. The main part of the imp...
متن کاملPlanarity Algorithms via PQ-Trees
We give a linear-time planarity test that unifies and simplifies the algorithms of Shih and Hsu and Boyer and Myrvold; in our view, these algorithms are really one algorithm with different implementations. This leads to a short and direct proof of correctness without the use of Kuratowski’s theorem. Our planarity test extends to give a uniform random embedding, to count embeddings, to represent...
متن کاملPC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent partial embeddings of planar graphs. PQ-trees were invented by Booth and Lueker [1] to test the consecutive ones property in matrices. The original implementation of the PQ-tree algorithms by Booth and Lueker using nine t...
متن کاملLempel, Even, and Cederbaum Planarity Method
We present a simple pedagogical graph theoretical description of Lempel, Even, and Cederbaum (LEC) planarity method based on concepts due to Thomas. A linear-time implementation of LEC method using the PC-tree data structure of Shih and Hsu is provided and described in details. We report on an experimental study involving this implementation and other available linear-time implementations of pl...
متن کاملA New Planarity Test
Given an undirected graph, the planarity testing problem is to determine whether the graph can be drawn in the plane without any crossing edges. Linear time planarity testing algorithms have previously been designed by Hopcroft and Tarjan, and by Booth and Lueker. However, their approaches are quite involved. Several other approaches have also been developed for simplifying the planariy test. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003